Linear Logic without Units

نویسنده

  • Robin Houston
چکیده

We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of pro-monoidal category. Since the theory of promonoidal categories has not been developed very thoroughly, at least in the published literature, we need to develop it here. The most natural way to do this – and the simplest, once the (substantial) groundwork has been laid – is to consider promonoidal categories as an instance of the general theory of pseudomonoids in a monoidal bicategory. Accordingly, we describe and explain the notions of monoidal bicategory and pseudomonoid therein. The higher-dimensional nature of monoidal bicategories presents serious no-tational difficulties, since to use the natural analogue of the commutative diagrams used in ordinary category theory would require the use of three-dimensional diagrams. We therefore introduce a novel technical device, which we dub the calculus of components, that dramatically simplifies the business of reasoning about a certain class of algebraic structure internal to a monoidal bicate-gory. When viewed through this simplifying lens, the theory of pseudomonoids turns out to be essentially formally identical to the ordinary theory of monoidal categories – at least in the absence of permutative structure such as braiding or symmetry. We indicate how the calculus of components may be extended to cover structures that make use of the braiding in a braided monoidal bicate-gory, and use this to study braided pseudomonoids. A higher-dimensional analogue of Cayley's theorem is proved, and used to deduce a novel characterisation of the unit of a promonoidal category. This, and the other preceding work, is then used to give two characterisations of the categories that model the unitless fragment of intuitionistic multiplicative linear logic. Finally we consider the non-intuitionistic case, where the second charac-terisation in particular takes a surprisingly simple form.  Declaration No portion of the work referred to in this thesis has been submitted in support of an application for another degree or qualification of this or any other university or other institute of learning.  Copyright The author of this thesis (including any appendices and/or schedules to this thesis) owns any copyright in it (the " Copyright ") and he has given The University of Manchester the right to use such Copyright for any administrative, promotional , educational and/or teaching purposes. Copies of this thesis, either in full or in extracts, may be made only in accordance with …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

System BV without the Equalities for Unit

System BV is an extension of multiplicative linear logic with a non-commutative self-dual operator. In this paper we present systems equivalent to system BV where equalities for unit are oriented from left to right and new structural rules are introduced to preserve completeness. While the first system allows units to appear in the structures, the second system makes it possible to completely r...

متن کامل

A pr 2 00 5 Modelling Linear Logic without Units ( Preliminary Results )

Proof nets for MLL, unit-free Multiplicative Linear Logic (Girard, 1987), provide elegant, abstract representations of proofs. Cut-free MLL proof nets form a category, under path composition, in the manner of EilenbergKelly-Mac Lane graphs (Eilenberg and Kelly, 1966; Kelly and Mac Lane, 1971). Objects are formulas of MLL, and a morphism A → B, a proof net from A to B, is a linking or matching b...

متن کامل

Modelling Linear Logic Without Units (Preliminary Results)

Proof nets for MLL, unit-free Multiplicative Linear Logic (Girard, 1987), provide elegant, abstract representations of proofs. Cut-free MLL proof nets form a category, under path composition, in the manner of EilenbergKelly-Mac Lane graphs (Eilenberg and Kelly, 1966; Kelly and Mac Lane, 1971). Objects are formulas of MLL, and a morphism A → B, a proof net from A to B, is a linking or matching b...

متن کامل

A linear algorithm for MLL proof net correctness and sequentialization

The paper presents in full details the first linear algorithm given in the literature [6] implementing proof structure correctness for multiplicative linear logic without units. The algorithm is essentially a reformulation of the Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linea...

متن کامل

MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams

Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the question of proofnets: finding canonical representatives of equivalence classes of proofs that have good computational properties. It can also be seen as the word p...

متن کامل

Proof equivalence in MLL is PSPACE-complete

MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for ∗-autonomous categories. Previous work has shown the problem to be equivalent to a rewiring problem on proof nets, which are not canonical for full MLL due to the presence of the two units. Drawing from rec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1305.2231  شماره 

صفحات  -

تاریخ انتشار 2008